Locally Adaptive Greedy Approximations for Anisotropic Parameter Reduced Basis Spaces
نویسندگان
چکیده
Reduced order models, in particular the reduced basis method, rely on empirically built and problem dependent basis functions that are constructed during an off-line stage. In the on-line stage, the precomputed problem-dependent solution space, that is spanned by the basis functions, can then be used in order to reduce the size of the computational problem. For complex problems, the number of basis functions required to guarantee a certain error tolerance can become too large in order to benefit computationally from the model reduction. To overcome this, the present work introduces a framework where local approximation spaces (in parameter space) are used to define the reduced order approximation in order to have explicit control over the on-line cost. This approach also adapts the local approximation spaces to local anisotropic behavior in the parameter space. We present the algorithm and numerous numerical tests.
منابع مشابه
Adaptive and Local Model Order Reduction with Machine Learning for Parametrized Systems
Computing density estimators with maximum a posteriori and sparse grids Locally adaptive greedy approximations for anisotropic parameter reduced basis spaces
متن کاملAn "hp" Certified Reduced Basis Method for Parametrized Elliptic Partial Differential Equations
We present a new “hp” parameter multi-domain certified reduced basis method for rapid and reliable online evaluation of functional outputs associated with parametrized elliptic partial differential equations. We propose a new procedure and attendant theoretical foundations for adaptive partition of the parameter domain into parameter subdomains (“h”-refinement); subsequently, we construct indiv...
متن کاملModel-Constrained Optimization Methods for Reduction of Parameterized Large-Scale Systems
Most model reduction techniques employ a projection framework that utilizes a reduced-space basis. The basis is usually formed as the span of a set of solutions of the large-scale system, which are computed for selected values (samples) of input parameters and forcing inputs. In existing model reduction techniques, choosing where and how many samples to generate has been, in general, an ad-hoc ...
متن کاملFitting the Three-parameter Weibull Distribution by using Greedy Randomized Adaptive Search Procedure
The Weibull distribution is widely employed in several areas of engineering because it is an extremely flexible distribution with different shapes. Moreover, it can include characteristics of several other distributions. However, successful usage of Weibull distribution depends on estimation accuracy for three parameters of scale, shape and location. This issue shifts the attentions to the requ...
متن کاملReduced Basis Model Reduction of Parametrized Two–Phase Flow in Porous Media ?
Many applications, e.g. in control theory and optimization depend on time– consuming parameter studies of parametrized evolution equations. Reduced basis methods are an approach to reduce the computation time of numerical simulations for these problems. The methods have gained popularity for model reduction of different numerical schemes with remarkable results preferably for scalar and linear ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 35 شماره
صفحات -
تاریخ انتشار 2013